A Bijective Proof of a Factorization Formula for Specialized Macdonald Polynomials
نویسندگان
چکیده
Let μ and ν = (ν1, . . . , νk) be partitions such that μ is obtained from ν by adding m parts of size r. Descouens and Morita proved algebraically that the modified Macdonald polynomials H̃μ(X; q, t) satisfy the identity H̃μ = H̃νH̃(rm) when the parameter t is specialized to an mth root of unity. Descouens, Morita, and Numata proved this formula bijectively when r ≤ νk and r ∈ {1, 2}. This note gives a bijective proof of the formula for all r ≤ νk. AMS Subject Classification Numbers: 05A19, 05E05, 05A05.
منابع مشابه
A Bijective Proof of a Factorization Formula for Macdonald Polynomials at Roots of Unity
We give a combinatorial proof of the factorization formula of modified Macdonald polynomials H̃λ(X ; q, t) when t is specialized at a primitive root of unity. Our proof is restricted to the special case where λ is a two columns partition. We mainly use the combinatorial interpretation of Haiman, Haglund and Loehr giving the expansion of H̃λ(X ; q, t) on the monomial basis.
متن کاملCombinatorial theory of Macdonald polynomials I: proof of Haglund's formula.
Haglund recently proposed a combinatorial interpretation of the modified Macdonald polynomials H(mu). We give a combinatorial proof of this conjecture, which establishes the existence and integrality of H(mu). As corollaries, we obtain the cocharge formula of Lascoux and Schutzenberger for Hall-Littlewood polynomials, a formula of Sahi and Knop for Jack's symmetric functions, a generalization o...
متن کاملThe Schur Expansion of Macdonald Polynomials
Building on Haglund’s combinatorial formula for the transformed Macdonald polynomials, we provide a purely combinatorial proof of Macdonald positivity using dual equivalence graphs and give a combinatorial formula for the coefficients in the Schur expansion.
متن کاملA Combinatorial Formula for Macdonald Polynomials
The Macdonald polynomials H̃μ(x; q, t) have been the subject of much attention in combinatorics since Macdonald [25] defined them and conjectured that their expansion in terms of Schur polynomials should have positive coefficients. Macdonald’s conjecture was proven in [11] by geometric and representation-theoretic means, but these results do not provide any purely combinatorial interpretation fo...
متن کاملA Combinatorial Identity Concerning Plane Colored Trees and its Applications
In this note, we obtain a combinatorial identity by counting some colored plane trees. This identity has a plethora of implications. In particular, it solves a bijective problem in Stanley’s collection “Bijective Proof Problems”, and gives a formula for the Narayana polynomials, as well as an equivalent expression for the Harer-Zagier formula enumerating unicellular maps.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014